Finding Frequent Subpaths in a Graph
نویسندگان
چکیده
منابع مشابه
Finding Frequent Subpaths in a Graph
The problem considered is that of finding frequent subpaths of a database of paths in a fixed undirected graph. This problem arises in applications such as predicting congestion in network and vehicular traffic. An algorithm, called AFS, based on the classic frequent itemset mining algorithm Apriori is developed, but with significantly improved efficiency over Apriori from exponential in transa...
متن کاملEfficiently Mining Frequent Subpaths
The problem considered is that of finding frequent subpaths of a database of paths in a fixed undirected graph. This problem arises in applications such as predicting congestion in network traffic. An algorithm based on Apriori, called AFS, is developed, but with significantly improved efficiency through exploiting the underlying graph structure, which makes AFS feasible for practical input pat...
متن کاملFinding Frequent Subgraphs in a Single Graph based on Symmetry
Mining frequent subgraphs is a basic activity that plays an important role in mining graph data. In this paper an algorithm is proposed to find frequent subgraphs in a single large graph that has applications such as protein interactions, social networks, web interactions. One of the key operations required by any frequent subgraph discovery algorithm is to perform graph isomorphism. The propos...
متن کاملFinding Frequent Subgraphs in Longitudinal Social Network Data Using a Weighted Graph Mining Approach
The mining of social networks entails a high degree of computational complexity. This complexity is exacerbate when considering longitudinal social network data. To address this complexity issue three weighting schemes are proposed in this paper. The fundamental idea is to reduce the complexity by considering only the most significant nodes and links. The proposed weighting schemes have been in...
متن کاملFinding frequent items in parallel
We present a deterministic parallel algorithm for the k–majority problem, that can be used to find in parallel frequent items, i.e., those whose multiplicity is greater than a given threshold, and is therefore useful in the context of iceberg queries and many other different contexts. The algorithm can be used both in the on–line (stream) context and in the off–line setting, the difference bein...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Data Mining & Knowledge Management Process
سال: 2014
ISSN: 2231-007X,2230-9608
DOI: 10.5121/ijdkp.2014.4503